Operating System Algorithms by Nathan Adams

Author:Nathan Adams [Adams, Nathan]
Language: eng
Format: azw3
Publisher: UNKNOWN
Published: 2017-04-21T04:00:00+00:00

Or:

w = F - B

Example 1

time quantum = 4ms

Process Burst Time (ms)

P1 24

P2 3

P3 3

In this example we will start with P1 - but since its burst time is 24ms it will be preempted when the time reaches 4ms to give 4ms of processor time to P2. Since P2’s burst time is 3ms which is less than or equal to the given time quantum of 4ms it will run its full burst without being preempted. After that we will schedule P3, but keep in mind P1 still has 20ms burst time left. P3 also has a burst time 3 which means it will run its full burst. After P3 we will schedule P1 in 4ms bursts.

The gantt chart for this example would be:

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.